Joint content placement and storage allocation based on federated learning in F-RANs

Funding: This work was supported in part by Innovation Project of the Common Key Technology of Chongqing Science and Technology Industry (cstc2018jcyjAX0383), the special fund of Chongqing key laboratory (CSTC), and the Funding of CQUPT (A2016-83, GJJY19-2-23, A2020-270).Peer reviewedPublisher PD

Joint Content Placement and Storage Allocation Based on Federated Learning in F-RANs

With the rapid development of mobile communication and the sharp increase of smart mobile devices, wireless data traffic has experienced explosive growth in recent years, thus injecting tremendous traffic into the network. Fog Radio Access Network (F-RAN) is a promising wireless network architecture to accommodate the fast growing data traffic and improve the performance of network service. By deploying content caching in F-RAN, fast and repeatable data access can be achieved, which reduces network traffic and transmission latency. Due to the capacity limit of caches, it is essential to predict the popularity of the content and pre-cache them in edge nodes. In general, the classic prediction approaches require the gathering of users’ personal information at a central unit, giving rise to users’ privacy issues. In this paper, we propose an intelligent F-RANs framework based on federated learning (FL), which does not require gathering user data centrally on the server for training, so it can effectively ensure the privacy of users. In the work, federated learning is applied to user demand prediction, which can accurately predict the content popularity distribution in the network. In addition, to minimize the total traffic cost of the network in consideration of user content requests, we address the allocation of storage resources and content placement in the network as an integrated model and formulate it as an Integer Linear Programming (ILP) problem. Due to the high computational complexity of the ILP problem, two heuristic algorithms are designed to solve it. Simulation results show that the performance of our proposed algorithm is close to the optimal solution

Minimum-Cost Offloading for Collaborative Task Execution of MEC-Assisted Platooning

In this paper, we study the offloading decision of collaborative task execution between platoon and Mobile Edge Computing (MEC) server. The mobile application is represented by a series of fine-grained tasks that form a linear topology, each of which is either executed on a local vehicle, offloaded to other members of the platoon, or offloaded to a MEC server. The objective of the design is to minimize the cost of tasks offloading and meets the deadline of tasks execution. The cost minimized task decision problem is transformed into the shortest path problem, which is limited by the deadline of the tasks on a directed acyclic graph. The classical Lagrangian Relaxation-based Aggregated Cost (LARAC) algorithm is adopted to solve the problem approximately. Numerical analysis shows that the scheduling method of the tasks decision can be well applied to the platoon scenario and execute the tasks in cooperation with the MEC server. In addition, compared with task local execution, platoon execution and MEC server execution, the optimal offloading decision for collaborative task execution can significantly reduce the cost of task execution and meet deadlines